#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e4 + 5;
const int INF = 2e9 + 7;

int n, m;
int d[N], c[N], s[N], w[N];
int st[N], ed[N];
vector<int> pre[N];
int f[N];
int mn[N << 2], tag[N << 2];
void pushup(int p) { mn[p] = min(mn[p << 1], mn[p << 1 | 1]); }
void build(int p, int l, int r) {
  tag[p] = 0;
  if (l == r) {
    mn[p] = f[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(p << 1, l, mid);
  build(p << 1 | 1, mid + 1, r);
  pushup(p);
}
void addtag(int p, int d) {
  tag[p] += d;
  mn[p] += d;
}
void pushdown(int p) {
  if (tag[p]) {
    addtag(p << 1, tag[p]);
    addtag(p << 1 | 1, tag[p]);
    tag[p] = 0;
  }
}
void update(int L, int R, int d, int p, int l, int r) {
  if (L > R) return;
  if (L <= l && R >= r) {
    addtag(p, d);
    return;
  }
  pushdown(p);
  int mid = (l + r) >> 1;
  if (L <= mid) update(L, R, d, p << 1, l, mid);
  if (R > mid) update(L, R, d, p << 1 | 1, mid + 1, r);
  pushup(p);
}
int query(int L, int R, int p, int l, int r) {
  if (L > R) return 0;
  if (L <= l && R >= r) return mn[p];
  pushdown(p);
  int mid = (l + r) >> 1;
  int res = INF;
  if (L <= mid) res = min(res, query(L, R, p << 1, l, mid));
  if (R > mid) res = min(res, query(L, R, p << 1 | 1, mid + 1, r));
  return res;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  rep(i, 2, n) cin >> d[i];
  rep(i, 1, n) cin >> c[i];
  rep(i, 1, n) cin >> s[i];
  rep(i, 1, n) cin >> w[i];
  ++n, ++m;
  d[n] = INF;
  rep(i, 1, n) {
    st[i] = lower_bound(d + 1, d + n + 1, d[i] - s[i]) - d;
    ed[i] = lower_bound(d + 1, d + n + 1, d[i] + s[i] + 1) - d - 1;
    pre[ed[i]].push_back(i);
  }
  int sum = 0;
  rep(i, 1, n) {
    f[i] = sum + c[i];
    for (int j : pre[i]) {
      sum += w[j];
    }
  }
  int ans = f[n];
  rep(j, 2, m) {
    build(1, 1, n);
    rep(i, 1, n) {
      f[i] = query(1, i - 1, 1, 1, n) + c[i];
      for (int u : pre[i]) {
        int v = st[u] - 1;
        update(1, v, w[u], 1, 1, n);
      }
    }
    ans = min(ans, f[n]);
  }
  cout << ans;
  return 0;
}